New optimal class of higher-order methods for multiple roots, permitting f′(xn) = 0

نویسندگان

  • Vinay Kanwar
  • Saurabh Bhatia
  • Munish Kansal
چکیده

Finding multiple zeros of nonlinear functions pose many difficulties for many of the iterative methods. A major difficulty in the application of iterative methods is the selection of initial guess such that neither guess is far from zero nor the derivative is small in the vicinity of the required root, otherwise the methods would fail miserably. Finding a criterion for choosing initial guess is quite cumbersome and therefore, more effective globally convergent algorithms for multiple roots are still needed. Therefore, the aim of this paper is to present an improved optimal class of higher-order methods having quartic convergence, permitting f 0(x) = 0 in the vicinity of the required root. The present approach of deriving this optimal class is based on weight function approach. All the methods considered here are found to be more effective and comparable to the similar robust methods available in literature. 2013 Elsevier Inc. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Basin attractors for various methods

M. Scott et al. / Applied Mathematics and Computation 218 (2011) 2584–2599 2585 (1) How does the basin of attraction differ for algorithms with the same order of convergence. (2) How does the basin of attraction differ for algorithms with different order of convergence. (3) Can the differences be used to compare various algorithms? In this paper we will discuss some qualitative issues using the...

متن کامل

On Constructing a Cubically Convergent Numerical Method for Multiple Roots

We propose the numerical method defined by xn+1 = xn − λ f(xn − μh(xn)) f ′(xn) , n ∈ N, and determine the control parameter λ and μ to converge cubically. In addition, we derive the asymptotic error constant. Applying this proposed scheme to various test functions, numerical results show a good agreement with the theory analyzed in this paper and are proven using Mathematica with its high-prec...

متن کامل

THIRD-ORDER AND FOURTH-ORDER ITERATIVE METHODS FREE FROM SECOND DERIVATIVE FOR FINDING MULTIPLE ROOTS OF NONLINEAR EQUATIONS

In this paper, we present two new families of third-order and fourth-order methods for finding multiple roots of nonlinear equations. Each of them requires one evaluation of the function and two of its first derivative per iteration. Several numerical examples are given to illustrate the performance of the presented methods.    

متن کامل

A third-order modification of Newton's method for multiple roots

Keywords: Newton's method Multiple roots Iterative methods Nonlinear equations Order of convergence Root-finding a b s t r a c t In this paper, we present a new third-order modification of Newton's method for multiple roots, which is based on existing third-order multiple root-finding methods. Numerical examples show that the new method is competitive to other methods for multiple roots. Solvin...

متن کامل

On the convergence of a higher order family of methods and its dynamics

where F is a differentiable function defined on a convex subset D of S with values in S, where S is R or C. using Mathematical Modelling. Except in special cases, the solutions of these equations can be found in closed form. This is the main reason why the most commonly used solution methods are usually iterative. In this work, we study the local convergence and the dynamics of the following op...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 222  شماره 

صفحات  -

تاریخ انتشار 2013